Upgrading destruction?

Upgrading Bottleneck Constrained Forests

We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of each link emanating from v. The goal is to nd a minimum cost set of nodes to be upgraded so that the resulting network has a good performance. The performance is measured by the bottleneck weight of a con...

Learning for Upgrading

Upgrading Narrow Gauge Standards

When the railways were nationalized between 1906 and 1907, the skeleton of the nationwide trunk rail network was nearly completed, as mandated in the Railway Construction Act of 1892. At the end of 1907, nationalized railway lines in operation totalled 7,165 km. Construction continued and 2,677 km of line were added by the end of 1919. In addition to active line expansion, the first decade afte...

Upgrading Links for Performance*

The performance of a computer network is commonly measured by the maximum minimum time required to move a certain amount of data between any 2 nodes in the network. Due to the advances in technology, certain links in the network may be upgraded, for instance to optical fibre links, so that better performance can be achieved. In this paper, we study the LINK UPGRADE problem for networks. We firs...

Upgrading a Multifuncoid

I define the concepts of multifuncoid (and completary multifuncoid) and upgrading. Then I conjecture that upgrading of certain multifuncoids are multifuncoids (and that upgrading certain completary multifuncoids are completary multifuncoids). I have proved the conjectures for n 6 2. This short article is the first my public writing where I introduce the concept of multidimensional funcoid which...